Relation Classification via LSTMs Based on Sequence and Tree Structure
نویسندگان
چکیده
منابع مشابه
End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures
We present a novel end-to-end neural model to extract entities and relations between them. Our recurrent neural network based model captures both word sequence and dependency tree substructure information by stacking bidirectional treestructured LSTM-RNNs on bidirectional sequential LSTM-RNNs. This allows our model to jointly represent both entities and relations with shared parameters in a sin...
متن کاملTree-kNN: A Tree-Based Algorithm for Protein Sequence Classification
The phylogenomic classification of protein sequences attempts to categorize a given protein within the evolutionary context of the entire family. It involves mainly four steps: selection of homologous sequences, multiple sequence alignment, phylogenetic tree construction and tree-based classification. This supposes that the tree used as a basis of protein classification is correct. Sequence ali...
متن کاملHead-Lexicalized Bidirectional Tree LSTMs
Sequential LSTMs have been extended to model tree structures, giving competitive results for a number of tasks. Existing methods model constituent trees by bottom-up combinations of constituent nodes, making direct use of input word information only for leaf nodes. This is different from sequential LSTMs, which contain references to input words for each node. In this paper, we propose a method ...
متن کاملA tree-based approach for motif discovery and sequence classification
MOTIVATION Pattern discovery algorithms are widely used for the analysis of DNA and protein sequences. Most algorithms have been designed to find overrepresented motifs in sparse datasets of long sequences, and ignore most positional information. We introduce an algorithm optimized to exploit spatial information in sparse-but-populous datasets. RESULTS Our algorithm Tree-based Weighted-Positi...
متن کاملClassification by Tree 1 Running head: Classification by Tree Classification Based on Tree-Structured Allocation Rules
We consider the problem of classifying an unknown observation into one of several populations using tree-structured allocation rules. Although many parametric classification procedures are robust to certain assumption violations, there is need for discriminant procedures that can be utilized regardless of the group-conditional distributions that underlie the model. The treestructured allocation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2877934